package 力扣刷题.探索初级算法.数组.只出现一次的数字;

import java.util.Scanner;

public class Solution {
    public int singleNumber(int[] nums) {
        return 0;
    }
    public static void main(String[] args) {

        int len;
        Scanner s=new Scanner(System.in);
        len=s.nextInt();
        int[] nums=new int[len];
        for (int i = 0; i < len; i++) {
            nums[i]=s.nextInt();
        }
        System.out.println(new Solution().singleNumber(nums));
    }
}
